Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems
نویسندگان
چکیده
منابع مشابه
Perpetuality and Uniform Normalization in Orthogonal Rewrite Systems
We present two characterizations of perpetual redexes, which are redexes whose contractions retain the possibility of in nite reductions. These characterizations generalize and strengthen existing criteria for the perpetuality of redexes in orthogonal Term Rewriting Systems and the -calculus due to Bergstra and Klop, and others. To unify our results with those in the literature, we introduce Co...
متن کاملPerpetuality and Uniform Normalization
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. L evy's ordering on reductions) in nite reductions in Conditional Orthogonal Expression Reduction Systems. We use this strategy to derive two characterizations of perpetual redexes, i.e., redexes whose contractions retain the existence of in nite reductions. These characterizations generalize existin...
متن کاملPerpetuality and Strong Normalization in Orthogonal Term Rewriting Systems
We design a strategy that for any given term t in an Orthogonal Term Rewriting System (OTRS) constructs a longest reduction starting from t if t is strongly normalizable, and constructs an innnite reduction otherwise. For some classes of OTRSs the strategy is easily computable. We develop a method for nding the least upper bound of lengths of reductions starting from a strongly normalizable ter...
متن کاملNormalization Results for Typeable Rewrite Systems
In this paper we introduce Curryfied Term Rewriting Systems, and a notion of partial type assignment on terms and rewrite rules that uses intersection types with sorts and . Three operations on types – substitution, expansion, and lifting – are used to define type assignment, and are proved to be sound. With this result the system is proved closed for reduction. Using a more liberal approach to...
متن کاملStrong Normalization of Typeable Rewrite Systems
This paper studies termination properties of rewrite systems that are typeable using intersection types. It introduces a notion of partial type assignment on Curryfied Term Rewrite Systems, that consists of assigning intersection types to function symbols, and specifying the way in which types can be assigned to nodes and edges between nodes in the tree representation of terms. Two operations o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2001
ISSN: 0890-5401
DOI: 10.1006/inco.2000.2888